A Tuple Placement Technique For Databases
نویسندگان
چکیده
منابع مشابه
Tuple Merging in Probabilistic Databases
Real-world data are often uncertain and incomplete. In probabilistic relational data models uncertainty can be modeled on two levels. First by representing the uncertain instance of a tuple by a set of possible instances and second by assigning each tuple with its degree of membership to the considered relation. To overcome incompleteness, data from multiple sources need to be combined. In orde...
متن کاملLearning Tuple Probabilities in Probabilistic Databases
Learning the parameters of complex probabilistic-relational models from labeled training data is a standard technique in machine learning, which has been intensively studied in the subfield of Statistical Relational Learning (SRL), but—so far—this is still an under-investigated topic in the context of Probabilistic Databases (PDBs). In this paper, we focus on learning the probability values of ...
متن کاملDecision Trellis Models for Tuple Categorization in Databases
We introduce a probabilistic graphical model for supervised learning on databases with categorical attributes. The proposed graph contains hidden variables that play a role similar to nodes in decision trees and each of their states either corresponds to a class label or to a single attribute test. As a major diierence with respect to decision trees, the selection of the attribute to be tested ...
متن کاملA Placement Technique for Multiple-Voltage Design
A voltage-island architecture for systems-on-chip is an effective way to reduce active and static power. For such multiple supply designs, various layout architectures exist; however, placement algorithms that take advantage of a circuit rows style of implementation are not available to designers today. This paper presents two algorithms to place standard cells in a circuit rows style of implem...
متن کاملA Prefetching Technique for Object-Oriented Databases
We present a new prefetching technique for object-oriented databases which exploits the availability of multiprocessor client workstations. The prefetching information is obtained from the object relationships on the database pages and is stored in a Prefetch Object Table. This prefetching algorithm is implemented using multithreading. In the results we show the theoretical and empirical beneet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1985
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/28.3.291